Asymptotic distribution of two-protected nodes in random binary search trees
نویسندگان
چکیده
Wederive exactmoments of the number of 2-protected nodes in binary search trees grown from random permutations. Furthermore, we show that a properly normalized version of this tree parameter converges to a Gaussian limit. © 2012 Elsevier Ltd. All rights reserved.
منابع مشابه
Stein Couplings to Show Limit Laws for Fringe Trees
The binary search tree or Quicksort is the most used of all sorting algorithm, since it is both fast and simple. The random recursive tree is another extensively studied random tree. We have examined fringe trees in these two types of random trees, since the study of such subtrees appears to be an effective approach towards defining characteristics also of the whole tree. By using a representat...
متن کاملAsymptotic distribution of two-protected nodes in ternary search trees
We study protected nodes in m-ary search trees, by putting them in context of generalised Pólya urns. We show that the number of two-protected nodes (the nodes that are neither leaves nor parents of leaves) in a random ternary search tree is asymptotically normal. The methods apply in principle to m-ary search trees with larger m as well, although the size of the matrices used in the calculatio...
متن کاملLimit laws for functions of fringe trees for binary search trees and random recursive trees
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees and random recursive trees. The proofs use a new version of a representation by Devroye, and Stein’s method for both normal and Poisson approximation together with certain couplings. As a consequence, we give simple new proofs of the fact that the number of fringe trees of size k = kn in the binary...
متن کاملSpanning Tree Size in Random Binary Search Trees
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal distribution. The special case p = 2 reproves the recent result (obtained by the contraction method by Mahmoud and Neininger [Ann. Appl. Probab. 13 (2003) 253–276...
متن کاملProfiles of Random Trees: Correlation and Width of Ran- Dom Recursive Trees and Binary Search Trees
The levels of trees are nodes with the same distance to the root. We derive asymptotic approximations to the correlation coefficients of two level sizes in random recursive trees and binary search trees, which undergo sharp sign-changes when one level is fixed and the other one is varying. We also propose a new means for deriving an asymptotic estimate for the expected width, which is the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 25 شماره
صفحات -
تاریخ انتشار 2012